A new statistic on Dyck paths for counting 3-dimensional Catalan words
نویسندگان
چکیده
A 3-dimensional Catalan word is a on three letters so that the subword any two Dyck path. For given path D, recently defined statistic counts number of words with property exactly D. In this paper, we enumerate paths equal to certain values, including all primes. The formulas obtained are in terms Motzkin numbers and ballot numbers.
منابع مشابه
Counting Generalized Dyck Paths
The Catalan number has a lot of interpretations and one of them is the number of Dyck paths. A Dyck path is a lattice path from (0, 0) to (n, n) which is below the diagonal line y = x. One way to generalize the definition of Dyck path is to change the end point of Dyck path, i.e. we define (generalized) Dyck path to be a lattice path from (0, 0) to (m, n) ∈ N2 which is below the diagonal line y...
متن کاملA Schröder Generalization of Haglund's Statistic on Catalan Paths
Garsia and Haiman (J. Algebraic. Combin. 5 (1996), 191 − 244) conjectured that a certain sum Cn(q, t) of rational functions in q, t reduces to a polynomial in q, t with nonnegative integral coefficients. Haglund later discovered (Adv. Math., in press), and with Garsia proved (Proc. Nat. Acad. Sci. 98 (2001), 4313 − 4316) the refined conjecture Cn(q, t) = ∑ qareatbounce. Here the sum is over all...
متن کاملCounting Upper Interactions in Dyck Paths
A Dyck word w is a word over the alphabet {x, x} that contains as many letters x as letters x and such that any prefix contains at least as many letters x as letters x. The size of w is the number of letters x in w. A Dyck path is a walk in the plane, that starts from the origin, is made up of rises, i.e. steps (1, 1), and falls, i.e. steps (1,−1), remains above the horizontal axis and finishes...
متن کاملCounting Segmented Permutations Using Bicoloured Dyck Paths
A bicoloured Dyck path is a Dyck path in which each up-step is assigned one of two colours, say, red and green. We say that a permutation π is σ-segmented if every occurrence o of σ in π is a segment-occurrence (i.e., o is a contiguous subword in π). We show combinatorially the following results: The 132-segmented permutations of length n with k occurrences of 132 are in one-to-one corresponden...
متن کاملDyck Words, Lattice Paths, and Abelian Borders
We use results on Dyck words and lattice paths to derive a formula for the exact number of binary words of a given length with a given minimal abelian border length, tightening a bound on that number from Christodoulakis et al. (Discrete Applied Mathematics, 2014). We also extend to any number of distinct abelian borders a result of Rampersad et al. (Developments in Language Theory, 2013) on th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2023
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2022.113247